Polyhedral Knots and Links
نویسندگان
چکیده
This paper contains a survey of different methods for generating knots and links based on geometric polyhedra, suitable for applications in chemistry, biology, architecture, sculpture (or jewelry). We describe several ways of obtaining 4-valent polyhedral graphs and their corresponding knots and links from geometrical polyhedra: midedge construction, cross-curve and double-line covering, and edge doubling constructions. These methods are implemented in LinKnot and can be applied to the data bases of polyhedra. In a similar way, an edge doubling construction transforms fullerene graphs into alternating knot and link diagrams.
منابع مشابه
Ju n 20 01 The many faces of cyclic branched coverings of 2 - bridge knots and links ∗
We discuss 3-manifolds which are cyclic coverings of the 3-sphere, branched over 2-bridge knots and links. Different descriptions of these manifolds are presented: polyhedral, Heegaard diagram, Dehn surgery and coloured graph constructions. Using these descriptions, we give presentations for their fundamental groups, which are cyclic presentations in the case of 2-bridge knots. The homology gro...
متن کاملUnlinking Number and Unlinking Gap
After introducing the Bernhard-Jablan Conjecture, we computed rational links with an unlinking gap for n ≤ 16 crossings. Several new infinite multi-parameter families of rational knots and links with unlinking gap are described. The general principle for the construction of infinite families of links with an unlinking gap is proposed. New infinite families of polyhedral alternating links with u...
متن کاملOn Chirality of Toroidal Embeddings of Polyhedral Graphs
We investigate properties of spatial graphs on the standard torus. It is known that nontrivial embeddings of planar graphs in the torus contain a nontrivial knot or a nonsplit link due to [1],[2]. Building on this and using the chirality of torus knots and links [3],[4], we prove that nontrivial embeddings of simple 3connected planar graphs in the standard torus are chiral. For the case that th...
متن کاملKnot Tightening by Constrained Gradient Descent
We present new computations of approximately length-minimizing polygons with fixedthickness. These curves model the centerlines of “tight” knotted tubes with minimal length and fixedcircular cross-section. Our curves approximately minimize the ropelength (or quotient of length andthickness) for polygons in their knot types. While previous authors have minimized ropelength forpol...
متن کاملA New Euler's Formula for DNA Polyhedra
DNA polyhedra are cage-like architectures based on interlocked and interlinked DNA strands. We propose a formula which unites the basic features of these entangled structures. It is based on the transformation of the DNA polyhedral links into Seifert surfaces, which removes all knots. The numbers of components μ, of crossings c, and of Seifert circles s are related by a simple and elegant formu...
متن کامل